A Fast Numerical Method for Max-Convolution and the Application to Efficient Max-Product Inference in Bayesian Networks
نویسندگان
چکیده
منابع مشابه
A fast numerical method for max-convolution and the application to efficient max-product inference in Bayesian networks
Observations depending on sums of random variables are common throughout many fields; however, no efficient solution is currently known for performing max-product inference on these sums of general discrete distributions (max-product inference can be used to obtain maximum a posteriori estimates). The limiting step to max-product inference is the max-convolution problem (sometimes presented in ...
متن کاملA more accurate numerical max-convolution method for sub-quadratic Bayesian inference with additive factors
Max-convolution is an important problem closely resembling standard convolution; as such, max-convolution occurs frequently across many fields. Here we extend the method with fastest known worst-case runtime, which can be applied to nonnegative vectors by numerically approximating the Chebyshev norm ‖ · ‖∞, and derive a more accurate method. The absolute error of the proposed method is bounded ...
متن کاملA Bounded p-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors
Max-convolution is an important problem closely resembling standard convolution; as such, maxconvolution occurs frequently across many fields. Here we extend the method with fastest known worst-case runtime, which can be applied to nonnegative vectors by numerically approximating the Chebyshev norm ‖ · ‖∞, and use this approach to derive two numerically stable methods based on the idea of compu...
متن کاملAn Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کاملDecision Sum-Product-Max Networks
Sum-Product Networks (SPNs) were recently proposed as a new class of probabilistic graphical models that guarantee tractable inference, even on models with high-treewidth. In this paper, we propose a new extension to SPNs, called Decision Sum-Product-Max Networks (Decision-SPMNs), that makes SPNs suitable for discrete multi-stage decision problems. We present an algorithm that solves Decision-S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2015
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.2015.0013